Degrees of sensible lambda theories

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solution of a Problem of Barendregt on Sensible lambda-Theories

H is the theory extending β-conversion by identifying all closed unsolvables. Hω is the closure of this theory under the ω-rule (and β-conversion). A long-standing conjecture of H. Barendregt states that the provable equations of Hω form a Π11-complete set. Here we prove that conjecture.

متن کامل

Lambda Theories of Effective Lambda Models

A longstanding open problem is whether there exists a nonsyntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which covers...

متن کامل

The Lattice of Lambda Theories

Lambda theories are equational extensions of the untyped lambda calculus that are closed under derivation. The set of lambda theories is naturally equipped with a structure of complete lattice, where the meet of a family of lambda theories is their intersection, and the join is the least lambda theory containing their union. In this paper we study the structure of the lattice of lambda theories...

متن کامل

Lambda Calculus: Models and Theories

In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λ-theories, the equational incompleteness of lambda calculus semantics, and the λ-theories induced by graph models of lambda calculus.

متن کامل

Intersection Types and Lambda Theories

We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of λ-theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a predicate. This allows us to prove the consistency of a well-know λ-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 1978

ISSN: 0022-4812,1943-5886

DOI: 10.2307/2271947